منابع مشابه
Planar 3-dimensional assignment problems with Monge-like cost arrays
Given an n× n× p cost array C we consider the problem p-P3AP which consists in finding p pairwise disjoint permutations φ1, φ2, . . . , φp of {1, . . . , n} such that ∑p k=1 ∑n i=1 ciφk(i)k is minimized. For the case p = n the planar 3-dimensional assignment problem P3AP results. Our main result concerns the p-P3AP on cost arrays C that are layered Monge arrays. In a layered Monge array all n×n...
متن کاملThe Isoperimetric Number of d-Dimensional k-Ary Arrays
The d{dimensional k{ary array A d k is the k{fold Cartesian product graph of the path P k on k vertices. We show that the (edge) isoperimetric number of A d k is given by i(A d k) = i(P k) = 1=b k 2 c for all k and d, and identify the cardinalities and the structure of the isoperimetric sets. For k odd, the cardinalities of the isoperimetric sets are 1 2 (k d ?1); 1 2 (k d ?k); : : : ; 1 2 (k d...
متن کاملOn Recovering Multi-Dimensional Arrays in Polly
Although many programs use multi-dimensional arrays, the multi-dimensional view of data is often not directly visible in the internal representation used by LLVM. In many situations, the only information available is an array base pointer and a single dimensional offset. For problems with parametric size, this offset is usually a multivariate polynomial that cannot be analyzed with integer line...
متن کاملExact sequences of extended $d$-homology
In this article, we show the existence of certain exact sequences with respect to two homology theories, called d-homology and extended d-homology. We present sufficient conditions for the existence of long exact extended d- homology sequence. Also we give some illustrative examples.
متن کاملMonge and Feasibility Sequences in General Flow Problems
Adler, I., A.J. Hoffman and R. Shamir, Monge and feasibility sequences in general flow problems, Discrete Applied Mathematics 44 (1993) 21-38. In a feasible transportation problem, there is always an ordering of the arcs such that greedily sending maximal flow on each arc in turn, according to that order, yields a feasible solution. We characterize those transportation graphs for which there ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1998
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(97)00007-4